/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;

map<ll, bool> mp;

ll f(ll n)
{
    ll sum = 0;
    while (n)
    {
        ll dig = n % 10;
        sum += (dig * dig);
        n /= 10;
    }
    return sum;
}

int main()
{
    IOS;
    ll n;
    cin >> n;
    mp[n] = true;
    while (true)
    {
        ll temp = f(n);
        if (temp == 1)
        {
            cout << "HAPPY" << endl;
            return 0;
        }
        if (mp[temp] == true)
        {
            cout << "UNHAPPY" << endl;
            return 0;
        }
        mp[temp] = true;
        n = temp;
    }
    getchar();
    getchar();
    return 0;
}
